Large alphabets and incompressibility
نویسندگان
چکیده
منابع مشابه
Large Alphabets and Incompressibility
We briefly survey some concepts related to empirical entropy — normal numbers, de Bruijn sequences and Markov processes — and investigate how well it approximates Kolmogorov complexity. Our results suggest lth-order empirical entropy stops being a reasonable complexity metric for almost all strings of length m over alphabets of size n about when nl surpasses m.
متن کاملFast Codes for Large Alphabets
We address the problem of constructing a fast lossless code in the case when the source alphabet is large. The main idea of the new scheme may be described as follows. We group letters with small probabilities in subsets (acting as super letters) and use time consuming coding for these subsets only, whereas letters in the subsets have the same code length and therefore can be coded fast. The de...
متن کاملApproximating kCSP For Large Alphabets
In this work we show that the constraint satisfaction problem (CSP), where constraints depend on k variables each and variables range over alphabet of size d, can be efficiently approximated to within Ω(kd/d) for any k,d. Previous work by Makarychev and Makarychev obtained an approximation ratio of Ω(kd/d) only for the case where the alphabet size d is at most exponentially large in k. In contr...
متن کاملUniversal Prediction over Large Alphabets
Insurance transfers losses associated with risks to the insurer for a price, the premium. Considering a natural probabilistic framework for the insurance problem, we derive a necessary and sufficient condition on loss models such that the insurer remains solvent despite the losses taken on. In particular, there need not be any upper bound on the loss—rather it is the structure of the model spac...
متن کاملEstimation and Compression Over Large Alphabets
OF THE DISSERTATION Estimation and Compression Over Large Alphabets
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2006
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2006.04.008